منابع مشابه
ULRIK BRANDES, GARRY ROBINS, ANN McCRANIE and STANLEY WASSERMAN
This is the beginning of Network Science. The journal has been created because network science is exploding. As is typical for a field in formation, the discussions about its scope, contents, and foundations are intense. On these first few pages of the first issue of our new journal, we would like to share our own vision of the emerging science of networks. 1 Is there a science of networks? Whe...
متن کاملWorking Part - Time : By Choice or By Constraint by Garry
The selection of workers into part-time jobs, and the wages they earn, are analysed using Canadian data. We focus on the distinction between voluntary and involuntary part-time workers since involuntary part-timers earn substantially lower wages than voluntary part-timers. We nd that the selection of individuals into involuntary part-time work is more closely tied to job characteristics such as...
متن کاملAutomated insulin delivery for t ype 1 diabetes Garry
Purpose of review Automated insulin delivery using the subcutaneous site for both glucose sensing and insulin delivery, while not commercially available, is starting to be implemented in the research environment. Here, we review issues with glucose sensing and insulin delivery algorithms that need to be resolved in order to achieve a closed-loop system. Recent findings Glucose sensing technolog...
متن کاملRanking Friends ∗
We investigate the scope for cooperation within a community engaged in repeated reciprocal interactions. Players seek the help of others and approach them sequentially according to some fixed order, that is, a ranking profile. We study the ranking profiles that correspond to the social structures that are most effective in sustaining cooperation in equilibrium, that is, social structures that s...
متن کاملA fast algorithm for identifying Friends-of-Friends halos
We describe a simple and fast algorithm for identifying friends-of-friends clusters and prove its correctness. The algorithm avoids unnecessary expensive neighbor queries, uses minimal memory overhead, and rejects slowdown in high over-density regions. We define our algorithm formally based on pair enumeration, a problem that has been heavily studied in fast 2-point correlation codes and our re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transatlantica
سال: 2014
ISSN: 1765-2766
DOI: 10.4000/transatlantica.7215